Invertible Low-Divergence Coding
نویسندگان
چکیده
Several applications in communication, control, and learning require approximating target distributions to within small informational divergence. The additional requirement of invertibility usually leads using encoders that are one-to-one mappings, also known as distribution matchers. However, even the best have divergences grow logarithmically with block length. To overcome this limitation, an encoder is proposed has invertible one-to-many mapping a low-rate random number generator (RNG). Two algorithms developed design by assigning strings either most-likely first or least-likely order. Both give information rates approaching entropy exponentially decreasing divergence vanishing RNG rate
منابع مشابه
Reliable Flow Control Coding in Low-Buffer Grid Networks
We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...
متن کاملArimoto Channel Coding Converse and Rényi Divergence
Arimoto [1] proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code on a given discrete memoryless channel. In this paper we present a simple derivation of the Arimoto converse based on the dataprocessing inequality for Rényi divergence. The method has two benefits. First, it generalizes to codes with feedback and gives the simplest proof of the stro...
متن کاملReliable Flow Control Coding in Low-Buffer Grid Networks
We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...
متن کاملInvertible Classes
This paper considers when one can invert general recursive operators which map a class of functions F to F . In this regard, we study four different notions of inversion. We additionally consider enumeration of operators which cover all general recursive operators which map F to F in the sense that for every general recursive operator Ψ mapping F to F , there is a general recursive operator in ...
متن کاملExtrinsic Jensen-Shannon Divergence: Applications to Variable-Length Coding
Abstract—This paper considers the problem of variable-length coding over a discrete memoryless channel (DMC) with noiseless feedback. The paper provides a stochastic control view of the problem whose solution is analyzed via a newly proposed symmetrized divergence, termed extrinsic Jensen–Shannon (EJS) divergence. It is shown that strictly positive lower bounds on EJS divergence provide non-asy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3120066